Lambek Grammars Based on Pregroups
نویسنده
چکیده
Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free pregroups. We prove that these grammars are equivalent to context-free grammars. We also discuss the relation of pregroups to the Lambek calculus.
منابع مشابه
Efficiency of Pregroups and the French Noun Phrase
We study mathematical and algorithmic properties of Lambek’s pregroups and illustrate them by the French noun phrase. An algorithm of complexity 3 n to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented. This algorithm is then specified to run in linear time. A sufficient condition for a language fragment that makes the linear alg...
متن کاملType Logics and Pregroups
We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whos...
متن کاملWojciech Buszkowski Type Logics and Pregroups
We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (quasi-ordered) bilinear algebras and pregroups w...
متن کاملOn Pregroups, Freedom, and (Virtual) Conceptual Necessity
Pregroups were introduced in (Lambek, 1999), and provide a foundation for a particularly simple syntactic calculus. Buszkowski (2001) showed that free pregroup grammars generate exactly the -free context-free languages. Here we characterize the class of languages generable by all pregroups, which will be shown to be the entire class of recursively enumerable languages. To show this result, we r...
متن کاملPregroup Grammars and Context-free Grammars
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...
متن کامل